Personalization of MDX Queries

نویسندگان

  • Hassina Mouloudi
  • Ladjel Bellatreche
  • Arnaud Giacometti
  • Patrick Marcel
چکیده

Answers of OLAP queries often cannot be visualized entirely and the user has to navigate through them to find relevant facts. One possible way to solve this problem is to personalize the queries. The basic idea behind the process of query personalization is that different users may find and see the facts they prefer without having to navigate. In this paper, we propose a framework for personalizing MDX queries. MDX allows the user to express complex queries on multidimensional data and to specify how the result will be presented on the screen. In this work, we present a preference model which allows the user to define his preferred dimensions and members. In addition, we provide an algorithm that, given an MDX query, a user profile and a visualization constraint, computes and displays the best answer to a user w.r.t. his (her) preferences and the constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Similairty Measure For Spatial Personalization

Extracting the relevant information by exploiting the spatial data warehouse becomes increasingly hard. In fact, because of the enormous amount of data stored in the spatial data warehouse, the user, usually, don't know what part of the cube contain the relevant information and what the forthcoming query should be. As a solution, we propose to study the similarity between the behaviors of the u...

متن کامل

Mining Preferences from OLAP Query Logs for Proactive Personalization

The goal of personalization is to deliver information that is relevant to an individual or a group of individuals in the most appropriate format and layout. In the OLAP context personalization is quite beneficial, because queries can be very complex and they may return huge amounts of data. Aimed at making the user’s experience with OLAP as plain as possible, in this paper we propose a proactiv...

متن کامل

Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC

In this paper, we present the first distinguishing attack on HMAC and NMAC based on MD5 without related keys, which distinguishes the HMAC/NMAC-MD5 from HMAC/NMAC with a random function. The attack needs 2 queries, with a success probability 0.87, while the previous distinguishing attack on HMAC-MD5 reduced to 33 rounds takes 2 messages with a success rate of 0.92. Furthermore, we give distingu...

متن کامل

Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments

Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX query, given that most data warehouses maintain a set of redundant materialized views to accelerate OLAP operations. A number of greedy and approximation algorithms have been proposed for different versions of the prob...

متن کامل

Recommending Multidimensional Queries

Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query should be in his current analysis. To better support this process we propose in this paper to apply a Collaborative Work approach that leverages former explorations of the cube to recommend OLAP queries. The system t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006